Generic copies of countable structures
نویسندگان
چکیده
منابع مشابه
Generic Expansions of Countable Models
We compare two different notions of generic expansions of countable saturated structures. On one hand there is a kind of genericity related to modelcompanions and to amalgamation constructions à la Hrushovski-Fräıssé; on the other, there is a notion of generic expansions defined via topological properties and Baire category theory. The second type of genericity was first formulated by Truss for...
متن کاملAutomorphism groups of countable structures
Suppose M is a countable first-order structure with a ‘rich’ automorphism group Aut(M). We will study Aut(M) both as a group and as a topological group, where the topology is that of pointwise convergence. This involves a mixture of model theory, group theory, combinatorics, descriptive set theory and topological dynamics. Here, ‘rich’ is undefined and depends on the context, but examples which...
متن کاملDistinguishing Number of Countable Homogeneous Relational Structures
The distinguishing number of a graph G is the smallest positive integer r such that G has a labeling of its vertices with r labels for which there is no non-trivial automorphism of G preserving these labels. In early work, Michael Albertson and Karen Collins computed the distinguishing number for various finite graphs, and more recently Wilfried Imrich, Sandi Klavžar and Vladimir Trofimov compu...
متن کاملComputability-theoretic complexity of countable structures
Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and...
متن کاملOn symmetric indivisibility of countable structures
A structure M ≤ N is symmetrically embedded in N if any σ ∈ Aut(M) extends to an automorphism of N . A countable structure M is symmetrically indivisible if for any coloring of M by two colors there exists a monochromatic M ≤ M such that M ∼= M and M is symmetrically embedded in M. We give a model-theoretic proof of the symmetric indivisibility of Rado’s countable random graph [9] and use these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1989
ISSN: 0168-0072
DOI: 10.1016/0168-0072(89)90015-8